Study of the automated biological laboratory project definition Volume I - Summary Final report, 10 Aug. 1964 - 10 Aug. 1965

Scientific payload objectives definition, and systems engineering for automated biological laboratory for exploration of life on Mar

Study of the automated biological laboratory project definition. Volume VI - Technical appendices. Part 1 Final report, 10 Aug. 1964 - 10 Aug. 1965

Instrumental, chemical, and environmental techniques for detecting extraterrestrial life on Mars - automatic biological laboratory for Mars exploratio

Study of the automated bioliogical laboratory project definition. Volume III - System engineering studies Final report, 10 Aug. 1964 - 10 Aug. 1965

Systems engineering studies for automated biological laboratory for exploration of life on Mar

Study of the automated biological laboratory project definition. Volume V - Exobiology bibliography Final report, 10 Aug. 1964 - 10 Aug. 1965

Annotated bibliography on various means of detecting extraterrestrial life for automated biological laboratory progra

Revisiting the Equivalence Problem for Finite Multitape Automata

The decidability of determining equivalence of deterministic multitape automata (or transducers) was a longstanding open problem until it was resolved by Harju and Karhum\"{a}ki in the early 1990s. Their proof of decidability yields a co_NP upper bound, but apparently not much more is known about the complexity of the problem. In this paper we give an alternative proof of decidability, which follows the basic strategy of Harju and Karhumaki but replaces their use of group theory with results on matrix algebras. From our proof we obtain a simple randomised algorithm for deciding language equivalence of deterministic multitape automata and, more generally, multiplicity equivalence of nondeterministic multitape automata. The algorithm involves only matrix exponentiation and runs in polynomial time for each fixed number of tapes. If the two input automata are inequivalent then the algorithm outputs a word on which they differ

Evolutionary Algorithms with Self-adjusting Asymmetric Mutation

Evolutionary Algorithms (EAs) and other randomized search heuristics are often considered as unbiased algorithms that are invariant with respect to different transformations of the underlying search space. However, if a certain amount of domain knowledge is available the use of biased search operators in EAs becomes viable. We consider a simple (1+1) EA for binary search spaces and analyze an asymmetric mutation operator that can treat zero- and one-bits differently. This operator extends previous work by Jansen and Sudholt (ECJ 18(1), 2010) by allowing the operator asymmetry to vary according to the success rate of the algorithm. Using a self-adjusting scheme that learns an appropriate degree of asymmetry, we show improved runtime results on the class of functions OneMax$_a$ describing the number of matching bits with a fixed target $a\in\{0,1\}^n$.Comment: 16 pages. An extended abstract of this paper will be published in the proceedings of PPSN 202

Quantum Games

In these lecture notes we investigate the implications of the identification of strategies with quantum operations in game theory beyond the results presented in [J. Eisert, M. Wilkens, and M. Lewenstein, Phys. Rev. Lett. 83, 3077 (1999)]. After introducing a general framework, we study quantum games with a classical analogue in order to flesh out the peculiarities of game theoretical settings in the quantum domain. Special emphasis is given to a detailed investigation of different sets of quantum strategies.Comment: 13 pages (LaTeX), 3 figure

Noncyclic covers of knot complements

Hempel has shown that the fundamental groups of knot complements are residually finite. This implies that every nontrivial knot must have a finite-sheeted, noncyclic cover. We give an explicit bound, $\Phi (c)$, such that if $K$ is a nontrivial knot in the three-sphere with a diagram with $c$ crossings and a particularly simple JSJ decomposition then the complement of $K$ has a finite-sheeted, noncyclic cover with at most $\Phi (c)$ sheets.Comment: 29 pages, 8 figures, from Ph.D. thesis at Columbia University; Acknowledgments added; Content correcte